// $Id: nodevanillapartitioniterative.cpp 72 2004-12-02 15:03:28Z jonas $

#include "nodevanillapartitioniterative.h"

/**
 * @todo Write documentation
 */
NodeVanillaPartitionIterative::NodeVanillaPartitionIterative(unsigned int bandwidthUp, unsigned int bandwidthDown, unsigned int routingTableSize, unsigned int fileStoreSize, unsigned int requestHopsToLive, unsigned int insertHopsToLive, float requestProbability, float insertProbability, FileHandler *fileHandler)
	: Node(bandwidthUp, bandwidthDown, routingTableSize, fileStoreSize, requestHopsToLive, insertHopsToLive, requestProbability, insertProbability, fileHandler), NodeVanilla(bandwidthUp, bandwidthDown, routingTableSize, fileStoreSize, requestHopsToLive, insertHopsToLive, requestProbability, insertProbability, fileHandler)
{
}

/**
 * Outsource the list ordering to our NodePartitionIterative class.
 *
 * @param file Sort the list with respect to this file.
 * @param list An empty list which will become an ordered list of neighbors.
 */
void NodeVanillaPartitionIterative::generateRequestOrderList(File *file, std::list<KeyDistanceHelper> &list)
{
	NodeVanilla::generateRequestOrderList(file, list);
	NodePartitionIterative::discriminateRequestOrderList(list);
}
